Counting dynamically synchronizing processes
نویسندگان
چکیده
منابع مشابه
Abstracting and Counting Synchronizing Processes
ing and Counting Synchronizing Processes Zeinab Ganjei, Ahmed Rezine, Petru Eles, and Zebo Peng Linköping University, Sweden Abstract. We address the problem of automatically establishing synchronization dependent correctness (e.g. due to using barriers or ensuring absence of deadlocks) of programs generating an arbitrary number of concurrent processes and manipulating variables ranging over an...
متن کاملSynchronizing Arbitrary Processor Groups in Dynamically Partitioned 2-D Meshes
A general purpose synchronization mechanism for a parallel computer should allow arbitrary, data-dependent, dynamically partitioned groups of processors to remain internally synchronized, while proceeding asynchron-ously with respect to other groups. We present an algorithm which can support such a scheme. The algorithm constructs binary synchronization trees for the subgroups , given a group o...
متن کاملThe Complexity of Synchronizing Markov Decision Processes
We consider Markov decision processes (MDP) as generators of sequences of probability distributions over states. A probability distribution is psynchronizing if the probability mass is at least p in a single state, or in a given set of states. We consider four temporal synchronizing modes: a sequence of probability distributions is always p-synchronizing, eventually p-synchronizing, weakly psyn...
متن کاملSynchronizing Objectives for Markov Decision Processes
We introduce synchronizing objectives for Markov decision processes (MDP). Intuitively, a synchronizing objective requires that eventually, at every step there is a state which concentrates almost all the probability mass. In particular, it implies that the probabilistic system behaves in the long run like a deterministic system: eventually, the current state of the MDP can be identified with a...
متن کاملA Fully Parallel Calculus of Synchronizing Processes
We propose a fully parallel calculus of synchronizing processes. The calculus was deeply inspired by LOTOS, of which it inherits multi-party synchronization in process parallel composition. On the other hand, its semantics is not interleaving whereas LOTOS one is. The model we propose is somehow in between Milner's SCCS and ASCCS in that independent actions are performed simultaneously, whereas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal on Software Tools for Technology Transfer
سال: 2016
ISSN: 1433-2779,1433-2787
DOI: 10.1007/s10009-015-0411-0